Underspecified Semantics for Dependency Grammars
نویسنده
چکیده
We link generative dependency grammars meeting natural modularity requirements with underspecified semantics of Discourse Plans intended to account for exactly those meaning components that grammars of languages mark for. We complete this link with a natural compilation of the modular dependency grammars into strongly equivalent efficiently analysed categorial dependency grammars.
منابع مشابه
Flexible Disambiguation and Expressive Completeness in Dependency Tree Semantics
This paper proposes an extension of Dependency Tree Semantics (DTS), an underspecified formalism originally proposed in Robaldo (2007). The crucial advantage of DTS as compared to other contemporary proposals is its ability to represent Independent Set (IS) readings (a.k.a. scopeless readings), e.g. cumulative and collective readings. DTS achieves the expressivity needed to represent IS reading...
متن کاملTowards a redundancy elimination algorithm for underspecified descriptions
Dependency Tree Semantics (DTS) is an underspecified formalism for representing quantifier scope ambiguities in natural language. DTS features a direct interface with a Dependency grammar and an incremental, constraint-based disambiguation mechanism. In this paper, we discuss the meaning of quantifier dependency in DTS by translating its well formed structures into formulae of a Second Order Lo...
متن کاملBridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints
Minimal Recursion Semantics (MRS) is the standard formalism used in large-scale HPSG grammars to model underspecified semantics. We present the first provably efficient algorithm to enumerate the readings of MRS structures. It is obtained by translating MRS into normal dominance constraints for which efficient algorithms exist.
متن کاملBridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints
Minimal Recursion Semantics (MRS) is the standard formalism used in large-scale HPSG grammars to model underspecified semantics. We present the first provably efficient algorithm to enumerate the readings of MRS structures. It is obtained by translating MRS into normal dominance constraints for which efficient algorithms exist.
متن کاملBridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints
Minimal Recursion Semantics (MRS) is the standard formalism used in large-scale HPSG grammars to model underspecified semantics. We present the first provably efficient algorithm to enumerate the readings of MRS structures, by translation into normal dominance constraints.
متن کامل